/*
 * Copyright (C) 2014 Tolstykh Vladislav
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 */

package lib.search.engine;

import com.google.common.collect.TreeMultimap;

/**
 * Иголка, которую будем искать.
 * @author Толстых Владислав
 */
public class Needle {
    private final TreeMultimap<Integer, Character> NEEDLE_MAP;
    private final boolean REGEX;
    
    /**
     * Новая "иголка".
     * @param chExpArr запрос как массив символов
     * @param regex искать неполные совпадения
     */
    public Needle(char[] chExpArr, boolean regex) {
        REGEX=regex;
        NEEDLE_MAP=TreeMultimap.create();
        fillHash(chExpArr);
    }
    
    /**
     * Заполнить хэш.
     * Ключ - индекс массива +1, значение - символ
     * @param chArr образ поиска ввиде массива символов
     */
    private void fillHash(char[] chArr) {
        for (int i = 0; i < chArr.length; i++) {
            char d = chArr[i];
            NEEDLE_MAP.put(i+1, d);//нумерация с еденицы
        }
    }
    
    /**
     * Схема поиска.
     * @return искать полное совпадение или частичное
     */
    boolean isRegex(){
        return REGEX;
    }
    
    /**
     * Тримап образа поиска.
     * @return хэш текстовой строки
     */
    TreeMultimap<Integer, Character> map(){
        return  NEEDLE_MAP;
    }
}
